Wavelength Add - Drop Multiplexing for Minimizing SONET

نویسنده

  • Charles J. Colbourn
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Drop Cost for SONET / WDMNetworks with 18 Wavelength

SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a `grooming', consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 1 8 of the wavelength capacity is determined , with few possible exceptions, when the ring size is a multiple of four.

متن کامل

Minimizing Drop Cost for SONET/WDM Networks with 18 Wavelength Requirements

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techni...

متن کامل

Minimizing drop cost for SONET/WDM networks with wavelength requirements

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techni...

متن کامل

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks using wavelength add-drop multiplexing, certain graph decompositions can be used to form a “grooming” that specifies the assignment of traffic to wavelengths. When traffic among nodes is all-to-all and uniform, the drop cost of such a decomposition is the sum, over all graphs in the decomposition, of the number ...

متن کامل

Local Search Heuristics for Cost Reduction in WDM Bidirectional Rings

In this note Local Search heuristics are proposed for the problem of minimizing the number of expensive Add-Drop Multiplexers in a SONET or SDH optical network ring, while respecting the constraints given by the overall number of fibers and the number of wavelengths that can carry separate information on a fiber.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999